Dynamic TCP acknowledgment in the LogP model

نویسندگان

  • Jens S. Kohrt
  • Kim S. Larsen
  • John Noga
  • Patchrawat Uthaisombut
چکیده

When messages, which are to be sent point-to-point in a network, become available at irregular intervals, a decision must be made each time a new message becomes available as to whether it should be sent immediately or if it is better to wait for more messages and send them all together. Because of physical properties of the networks, a certain minimum amount of time must elapse in between the transmission of two packets. Thus, whereas waiting delays the transmission of the current data, sending immediately may delay the transmission of the next data to become available even more. We propose a new quality measure and derive optimal deterministic and randomized algorithms for this on-line problem.  2003 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TCP Dynamic Acknowledgment Delay: Theory and Practice

We study an on-line problem that is motivated by the networking problem of dynamically adjusting delays of acknowledgments in the Transmission Control Protocol (TCP). The theoretical problem we study is the following. There is a sequence of n packet arrival times A = and a look-ahead coefficient L. The goal is to partition A into k subsequences sigma1, sigma2, ...,sigmak (where a subsequence en...

متن کامل

Dynamic TCP Acknowledgment and Other Stories about e / ( e − 1 ) 1

We present the first optimal randomized online algorithms for the TCP acknowledgment problem [3] and the Bahncard problem [5]. These problems are well known to be generalizations of the classical online ski-rental problem, however, they appeared to be harder. In this paper we demonstrate that a number of online algorithms which have optimal competitive ratios of e/(e − 1), including these, are ...

متن کامل

Improved Selective Acknowledgment Scheme for TCP

A selective acknowledgment (SACK) mechanism, combined with a selective repeat retransmission policy, has been proposed to overcome the limitations with the cumulative acknowledgment scheme in TCP. With the SACK mechanism, the receiver informs the sender about the noncontiguous blocks of data that have been received and queued. However, for each such noncontiguous block, SACK requires 8 bytes to...

متن کامل

Cross-layer based Smart Acknowledgment Scheme for TCP in MANETs

TCP upon wireless network is most challenging issue because of random losses and ACK interference. Also, TCP suffers from performance declination in terms of creating delay and overhead in network because of poor characteristics of wireless channel. In order to overcome these issues, we proposed a smart acknowledgment distribute channel access (SADCA) scheme for TCP in MANET. In the proposed sc...

متن کامل

Deadlock-Free TCP Over High- Speed Internet

In this paper, we consider TCP throughput deadlock problems caused by an interplay between the Nagle algorithm, delayed acknowledgment algorithm, and several implementation details. For some combinations of send and receive buffers, a TCP sender cannot send more segments due to the Nagle algorithm and, at the same time, a TCP receiver cannot acknowledge more segments received due to the delayed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Algorithms

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2003